On the growth factor in Gaussian elimination for generalized Higham matrices
نویسندگان
چکیده
The generalized Higham matrix is a complex symmetric matrix A = B + iC, where both B ∈ Cn×n and C ∈ Cn×n are Hermitian positive definite, and i = √−1 is the imaginary unit. The growth factor in Gaussian elimination is less than 3 √ 2 for this kind of matrices. In this paper, we give a new brief proof on this result by different techniques, which can be understood very easily, and obtain some new findings. Keywords—CSPD matrix, positive definite, Schur complement, Higham matrix, Gaussian elimination, Growth factor.
منابع مشابه
Large growth factors in Gaussian elimination with pivoting
The growth factor plays an important role in the error analysis of Gaussian elimination. It is well known that when partial pivoting or complete pivoting is used the growth factor is usually small, but it can be large. The examples of large growth usually quoted involve contrived matrices that are unlikely to occur in practice. We present real and complex n n matrices arising from practical app...
متن کاملSearching for Rare Growth Factors Using Multicanonical Monte Carlo Methods
The growth factor of a matrix quantifies the amount of potential error growth possible when a linear system is solved using Gaussian elimination with row pivoting. While it is an easy matter [N. J. Higham and D. J. Higham, SIAM J. Matrix Anal. Appl., 10 (1989), pp. 155–164] to construct examples of n × n matrices having any growth factor up to the maximum of 2n−1, the weight of experience and a...
متن کاملA Refinement on the Growth Factor in Gaussian Elimination for Accretive-dissipative Matrices
In this note, we give a refinement of the growth factor in Gaussian elimination for accretive-dissipative matrix A which is due to Lin [Calcolo, 2013, DOI 10.1007/s10092-013-0089-1].
متن کاملStability of a Pivoting Strategy for Parallel Gaussian Elimination
Gaussian elimination with partial pivoting achieved by adding the pivot row to the kth row at step k, was introduced by Onaga and Takechi in 1986 as a means for reducing communications in parallel implementations. In this paper it is shown that the growth factor of this partial pivoting algorithm is bounded above by μn < 3 n−1, as compared to 2n−1 for the standard partial pivoting. This bound μ...
متن کاملBlock LU Factorization
Many of the currently popular \block algorithms" are scalar algorithms in which the operations have been grouped and reordered into matrix operations. One genuine block algorithm in practical use is block LU factorization, and this has recently been shown by Demmel and Higham to be unstable in general. It is shown here that block LU factorization is stable if A is block diagonally dominant by c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Numerical Lin. Alg. with Applic.
دوره 9 شماره
صفحات -
تاریخ انتشار 2002